On the Compactness of Nonmonotonic Logics
نویسنده
چکیده
A weak concept of compactness for nonmonotonic logics is proposed, which is suitable for several nonmonotonic logics, for which Makinsons smallest cumulative extension as well as Freund/Lehmanns canonical extension fail.
منابع مشابه
Niemelä and Schwind : Proof Systems for Nonmonotonic Logics
A survey of proof systems for nonmonotonic logics is presented. In particular , proof methods for default logics, nonmonotonic modal logics, circum-scription, and conditional logics are discussed.
متن کاملHardware Implementation of Temporal Nonmonotonic Logics
In order to apply nonmonotonic logics for specifying industrial automation controllers, we define (1) a method to extend atemporal nonmonotonic logics with temporal operators and (2) a mapping of these new temporal nonmonotonic logics into a Metric Temporal Logic. This mapping provides a formal specification method for real-time temporal reasoning digital circuits for the temporal nonmonotonic ...
متن کاملA Uniform Tableaux Method for Nonmonotonic Modal Logics
We present a semantic tableaux calculus for propositional nonmonotonic modal logics, based on possible-worlds characterisations for nonmonotonic modal logics. This method is parametric with respect to both the modal logic and the preference semantics, since it handles in a uniform way the entailment problem for a wide class of nonmonotonic modal logics: McDermott and Doyle's logics and ground l...
متن کاملRepresentation Independence of Nonmonotonic Inference Relations
A logical concept of representation independence is developed for nonmonotonic logics , including probabilistic inference systems. The general framework then is applied to several nonmonotonic logics, particularly propo-sitional probabilistic logics. For these logics our investigation leads us to modiied inference rules with greater representation independence .
متن کاملModel Checking for Nonmonotonic Logics: Algorithms and Complexity
We study the complexity of model checking in propositional nonmonotonic logics. Specifically, we first define the problem of model checking in such formalisms, based on the fact that several nonmonotonic logics make use of interpretation structures (i.e. default extensions, stable expansions, universal Kripke models) which are more complex than standard interpretations of propositional logic. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996